#pragma GCC optimize(2)
#include<iostream>
#include<map>
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
using namespace std;
typedef long long ll;

const int N=200010;
map<ll,int> mp;
int d[N];
ll ans1[N];

int main()
{
	IOS;
	int n;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		ll l,r;
		cin>>l>>r;
		mp[l]++;
		mp[r+1]--;
	}
	int cnt=0;
	ll last=0;
	int ans=0;
	for(auto it =mp.begin();it!=mp.end();it++)
	{
		if(it==mp.begin())
		{
			ans+=it->second;
			last=it->first;
			continue;
		}
		ans1[ans]+=(it->first-last);
		ans+=it->second;
		last=it->first;
	}
	for(int i=1;i<=n;i++)
	cout<<ans1[i]<<' ';
	cout<<endl;
}

